翻訳と辞書 Words near each other ・ Optik ・ Optik (journal) ・ Optik Records ・ Optik Software ・ Optilan ・ Optile ・ Optima ・ Optima (disambiguation) ・ Optima (grape) ・ Optima Bus Corporation ・ Optima Lake ・ Optima National Wildlife Refuge ・ Optima Telekom ・ Optima, Oklahoma ・ Optimal asymmetric encryption padding ・ Optimal binary search tree ・ Optimal capital income taxation ・ Optimal computing budget allocation ・ Optimal control ・ Optimal cutting temperature compound ・ Optimal decision ・ Optimal design ・ Optimal discriminant analysis ・ Optimal distinctiveness theory ・ Optimal Energy Joule ・ Optimal estimation ・ Optimal Flexible Architecture ・ Optimal foraging theory ・ Optimal maintenance ・ Optimal matching Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Optimal binary search tree ： ウィキペディア英語版 Optimal binary search tree In computer science, an optimal binary search tree (BST), sometimes called a weight-balanced binary tree, is a binary search tree which provides the smallest possible search time (or expected search time) for a given sequence of accesses (or access probabilities). Optimal BSTs are generally divided into two types: static and dynamic. In the static optimality problem, the tree cannot be modified after it has been constructed. In this case, there exists some particular layout of the nodes of the tree which provides the smallest expected search time for the given access probabilities. Various algorithms exist to construct or approximate the statically optimal tree given the information on the access probabilities of the elements. In the dynamic optimality problem, the tree can be modified at any time, typically by permitting tree rotations. The tree is considered to have a cursor starting at the root which it can move or use to perform modifications. In this case, there exists some minimal-cost sequence of these operations which causes the cursor to visit every node in the target access sequence in order. The splay tree is conjectured to have a constant competitive ratio compared to the dynamically optimal tree in all cases, though this has not yet been proven. == Static optimality == 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Optimal binary search tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.